Cut-off points for the rational believer

Abstract I show that the Lottery Paradox is just a version of Sorites, and argue this should modify our way looking at itself. In particular, focus on what call “the Cut-off Point Problem” contend problem, well known by Sorites scholars, ought to play key role in debate Kyburg’s puzzle. Very briefly, that, Paradox, premises “ticket n°1 will lose”, n°2 lose”… n°1000 lose” are equivalent soritical form “~(the winning ticket {…, (t n )}) ⊃ ~(the t , + 1 )})” (where “⊃” material conditional, “~” negation symbol, “t ” n° 1” respectively, “{}” identify elements lottery tickets’ set. The brackets “(t )” meant point out antecedent conditional we do not always have (and, as result, consequent): consider {}) {t })”). As failing believe, for some ticket, it lose comes down introducing cut-off chain premises. paper explore consequences different ways blocking with respect Problem. A heap variant especially relevant evaluating solutions. One important result most popular puzzle, i.e., denying Lockean Thesis, becomes less attractive. Moreover, along whether rational belief closed under classical logic, validity modus ponens an discussions Paradox.